A route pre-computation algorithm for integrated services networks

We provide an algorithm for computing best paths on a graph where edges have a multidimensional cost, one dimension representing delay, the others representing available capacity. Best paths are those which guarantee maximum capacity with least possible delay. The complexity of the algorithm is of the order of O(V3) in the bidimensional case, for a graph withV vertices. The results can be used for routing connections with guaranteed capacity in a communication network

Proxy PNNI Augmented Routing (Proxy PAR)

: ATM networks often carry other popular communication protocols such as TCP/IP. LAN emulation techniques, with LANE and MPOA being the most prominent ones, make it possible to support existing applications, but do not take advantage of many ATM capabilities. Furthermore, such server-based solutions often suffer from single point of failure problems. PNNI Augmented Routing (PAR), based on Private Network-Network Interface (PNNI), enables ATM and TCP/IP to be better integrated than in an emulation environment. In addition to that, Proxy PAR has been introduced as minimal version of PAR that gives ATMattached devices the ability to interact with PNNI devices without the complexity associated with a full PAR implementation. Proxy PAR has been conceived as a client/server interaction in which the client side is much simpler than the server side, permitting fast implementation and deployment in existing IPv4 devices. The main purpose of Proxy PAR is to allow non-ATM devices to use the flood..

Lowering Security Overhead in Link State Routing

Security services in routing protocols are at the same time very important and very costly. This paper examines the cost of security in link state routing and develops techniques for efficient and secure processing of link state updates. Different approaches are recommended for stable and volatile network environments. Applications to mobile ad hoc networks are also considered. Keywords: link state routing, security, hash chains, ad hoc networks. 1 Introduction: Security of Routing Protocols As both the complexity and diversity of today's networks and internetworks grow, so does the need for new, more versatile and more efficient routing protocols. Since routing is a critical network function, security of routing protocols is naturally very important. This has been widely recognized by the designers of many routing protocols both past and present. Sound security, however, comes at a high price which translates into processing, bandwidth and storage overhead. Consequently, it is desir..